Technical Report: Achievable Rates for the MAC with Correlated Channel-State Information

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of the random binning technique used by Gel’fand and Pinsker for the problem with non-causal channel state information at the encoder in point to point communication. Index Terms Multi-user information theory, random binning, multiple access channel, dirty paper coding. I. THE PROBLEM SETUP We consider a discrete memoryless multiple access channel (MAC) with two correlated states each known by one of the encoders. Specifically, we assume the following model: P (y|x1, x2, s1, s2) and P (s1, s2), (1) where s1 ∈ S1 and s2 ∈ S2 are known non-causally at encoder 1 and encoder 2, respectively. The channel inputs are x1 ∈ X1 and x2 ∈ X2, and the channel output is y ∈ Y . The memoryless channel implies that P (y|x1,x2, s1, s2) = n